Parallel N-Free Order Recognition
نویسنده
چکیده
منابع مشابه
Efficient Parallel Recognition of Context-Free Languages
This paper presents an efficient parallel approach for recognition of context-free languages. The algorithm takes O(log n) time of computations on a fixed configuration of processors array with reconfigurable bus system. The number of processors required is O(n3). Processor architecture consists of multibus and multiple internal switches in the processors. A specific arrangement of processors i...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملSublinear Parallel Time Recognition of Tree Adjoining Languages
A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining grammars, a tree rewriting system which has applications in computational Linguistics. This class of languages is known to properly include all context-free languages; for example, the non-context-free sets {anbncn} and {ww) are in this class. It is shown that the recognition problem for tree ad...
متن کاملFormulation and Analysis of Parallel Context-Free Recognition and Parsing on a PRAM Model
A new parallel version of the CKY-algorithm for context-free recognition and parsing is presented. The proposed algorithm is formulated on a PRAM model. First we show that the CKY-algorithm can easily be formulated on a WRAM model taking O(n) time and O(n*> processors. An analysis of this formulation shows that the multiple enties in a location of recognition table can be ordered in a manner to...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 175 شماره
صفحات -
تاریخ انتشار 1997